A Comparison of SAT-Based and SMT-Based Bounded Model Checking Methods for ECTL
نویسندگان
چکیده
In this paper we present a comparison of the SAT-based bounded model checking (BMC) and SMT-based bounded model checking methods for ECTL properties of a parallel composition of transition systems. In the both methods we use the parallel composition (of the transition systems) based on the interleaved semantics. Moreover, the both methods use the same bounded semantics of ECTL formulae, the compatible encodings of the transition systems and the compatible translations of ECTL formulae. For the SAT-based BMC we have used the PicoSAT solver and for the SAT-based BMC we have used the Z3 solver. We have implemented the both methods and made some preliminary experimental results which shows that generally the SAT-based method is superior to the SMT-based method. However, in some cases the SMT-method overcomes the SAT-based method.
منابع مشابه
Improving the Translation from ECTL to SAT
The objective of this paper is to offer an improvement to the translation from ECTL to SAT introduced in [7] and show that the improvement proposed substantially increases the efficiency of verifying temporal properties using the Bounded Model Checking method. keywords: ECTL, Bounded Model Checking, translation to SAT
متن کاملSMT-based Bounded Model Checking for Weighted Interpreted Systems and for Weighted Epistemic ECTL
We define the SMT-based bounded model checking (BMC) method for Weighted Interpreted Systems and for the existential fragment of the Weighted Epistemic Computation Tree Logic. We implemented the new BMC algorithm and compared it with the SATbased BMC method for the same systems and the same property language on several benchmarks for multi-agent systems.
متن کاملA New Translation from ECTL* to SAT
In this paper we present a new translation from ECTL∗ to SAT and show that the proposed translation substantially increases the efficiency of verifying temporal properties using the Bounded Model Checking method. We have implemented our new translation and made experimental results, which demonstrate the efficiency of the method. keywords: ECTL∗, translation to SAT, Bounded Model Checking
متن کاملBounded Model Checking Approaches for Verification of Distributed Time Petri Nets
We consider two symbolic approaches to bounded model checking (BMC) of distributed time Petri nets (DTPNs). We focus on the properties expressed in Linear Temporal Logic without the neXt-time operator (LTL−X) and the existential fragment of Computation Tree Logic without the neXt-time operator (ECTL−X). We give a translation of BMC to SAT and describe a BDD-based BMC for both LTL−X and ECTL−X. ...
متن کاملSelected Methods of Model Checking using SAT and SMT-solvers: (Doctoral Consortium)
The objectives of this research are to further investigate the foundations for novel SMT and SAT-based bounded model checking (BMC) algorithms for real-time and multiagent systems. A major part of the research will involve the development of SMT-based BMC methods for standard Kripke structures, extended Kripke structures, and for different kinds of interpreted systems for different kinds of tem...
متن کامل